A Tabu Search Approach with Double Tabu-List for Multidimensional Knapsack Problems
نویسندگان
چکیده
The knapsack problems are a classic NP-hard problem in the combinational optimization. Inspired by the conclusion of the cognitive psychology about the human memory system, a Tabu Search method based on Double Tabu-List (DTL-TS) has been proposed to solve it. With the addition of the search strategy of intensification and diversification, the excellent experiment results have been gotten. Compared with ImmunoDominance Clone Algorithm, DTL-TS is shown to be an efficient approach of solving complex problems like 0-1 multidimensional knapsack problems.
منابع مشابه
Critical Event Tabu Search for Multidimensional Knapsack Problems
25 CRITICAL EVENT TABU SEARCH FOR MULTIDIMENSIONAL KNAPSACK PROBLEMS Fred Glover Graduate School of Business, Box 419 University of Colorado at Boulder Boulder, Colorado, 80309-0419 E-Mail: [email protected] Gary A. Kochenberger College of Business University of Colorado at Denver Denver, Colorado 80217-3364 E-Mail: [email protected] We report a new approach to creating a ...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملTabu search : global intensification using dynamic programming
Tabu search has proven highly successful in solving hard combinatorial optimization problems. In this paper, we propose a hybrid method that combines adaptive memory, sparse dynamic programming, and reduction techniques to reduce and explore the search space. Our approach starts with a bi-partition of the variables, involving a small core problem, which never exceeds 15 variables, solved using ...
متن کاملExtension of Reverse Elimination Method Through a Dynamic Management of the Tabu List
The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient condition to prevent cycling. The purpose of this paper is first to incorporate in REM a chronological order rule when cycling is unavoidable, thereby...
متن کاملParallel Skeletons for Tabu Search Method
In this paper we present two generic parallel skeletons for Tabu Search method –a well known meta-heuristic for approximately solving combinatorial optimization problems. The first skeleton is based on independent runs while the second in the classical master-slave model. Our starting point is the design and implementation of a sequential skeleton that is used later as basis for the two paralle...
متن کامل